Algorithms for computing triangular decomposition of polynomial systems
نویسندگان
چکیده
منابع مشابه
Algorithms for computing triangular decomposition of polynomial systems
We discuss algorithmic advances which have extended the pioneer work of Wu on triangular decompositions. We start with an overview of the key ideas which have led to either better implementation techniques or a better understanding of the underlying theory. We then present new techniques that we regard as essential to the recent success and for future research directions in the development of t...
متن کاملNotes on Triangular Sets and Triangulation-Decomposition Algorithms I: Polynomial Systems
This is the first in a series of two tutorial articles devoted to triangulationdecomposition algorithms. The value of these notes resides in the uniform presentation of triangulation-decomposition of polynomial and differential radical ideals with detailed proofs of all the presented results.We emphasize the study of the mathematical objects manipulated by the algorithms and show their properti...
متن کاملPolynomial Decomposition Algorithms
We examine the question of when a polynomial f over a commutative ring has a nontrivial functional decomposition f = g ◦ h. Previous algorithms [2, 3, 1] are exponential-time in the worst case, require polynomial factorization, and only work over fields of characteristic 0. We present an O(n2)-time algorithm. We also show that the problem is in NC . The algorithm does not use polynomial factori...
متن کاملPolynomial-time Algorithms for Computing Distances of Fuzzy Transition Systems
Behaviour distances to measure the resemblance of two states in a (nondeterministic) fuzzy transition system have been proposed recently in the literature. Such a distance, defined as a pseudo-ultrametric over the state space of the model, provides a quantitative analogue of bisimilarity. In this paper, we focus on the problem of computing these distances. We first extend the definition of the ...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2012
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.12.023